repo-compress: use chunkindex rather than repository.list() #8398
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
repository.list is slow, so rather use the chunkindex, which might be cached in future. currently, it also uses repository.list, but at least we can solve the problem at one place then.
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #8398 +/- ##
==========================================
- Coverage 81.55% 81.54% -0.01%
==========================================
Files 70 70
Lines 12723 12717 -6
Branches 2299 2297 -2
==========================================
- Hits 10376 10370 -6
Misses 1694 1694
Partials 653 653 ☔ View full report in Codecov by Sentry. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
repository.list is slow, so rather use the chunkindex, which might be cached in future.
currently, it also uses repository.list, but at least we can solve the problem at one place then.